A spectral Erdős-Stone theorem
نویسنده
چکیده
Let r ≥ 2 and c > 0. If G is a graph of order n and the largest eigenvalue of its adjacency matrix satisfies μ (G) ≥ (1− 1/r + c)n, then G contains a complete r-partite subgraph with r − 1 parts of size ⌊
منابع مشابه
A p-part Erdős-Ko-Rado theorem
We prove a p-part extension of the Erdős-Ko-Rado Theorem and suggest several related open problems. For the basic case of two parts we describe two proofs, a combinatorial one and a spectral one.
متن کاملSpectral analogues of Erdős’ and Moon-Moser’s theorems on Hamilton cycles
In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore’s theorem. One year later, Moon and Moser gave an analogous result for Hamilton cycles in balanced bipartite graphs. In this paper we present the spectral analogues of Erdős’ theorem and Moon-Moser’s theorem, respectively. Let Gk n be the ...
متن کاملA note on spectral mapping theorem
This paper aims to present the well-known spectral mapping theorem for multi-variable functions.
متن کاملA Uniqueness Theorem of the Solution of an Inverse Spectral Problem
This paper is devoted to the proof of the unique solvability ofthe inverse problems for second-order differential operators withregular singularities. It is shown that the potential functioncan be determined from spectral data, also we prove a uniquenesstheorem in the inverse problem.
متن کاملSpectral Stieltjes-type Integration and Some Applications
This paper presents Stieltjes-type integration for operator-valued functions with respect to spectral families. The relation between RiemannStieltjes integrals associated with some classes of spectral families including, in particular, those that arise in the context of the Stone representation theorem for Banach spaces is established. The developed approach is applied to the structural analysi...
متن کامل